Abstract Hilbertian deductive systems, infon logic, and Datalog

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Abstract Hilbertian deductive systems, infon logic, and Datalog

Hilbertian Deductive Systems, Infon Logic, and Datalog Andreas Blassa,1,∗, Yuri Gurevich aMathematics Department, University of Michigan, Ann Arbor, MI 48109, USA bMicrosoft Research, One Microsoft Way, Redmond, WA 98052, USA

متن کامل

Hilbertian Deductive Systems, Infon Logic, and Datalog

In the first part of the paper, we develop a general method for converting derivability problems, from a broad range of deductive systems, into the derivability problem in a quite specific system, namely the Datalog fragment of universal Horn logic. In this generality, the derivability problems may not be recursively solvable, let alone feasible; in particular, we may get Datalog “programs” wit...

متن کامل

From Primal Infon Logic with Individual Variables to Datalog

The logic core of Distributed Knowledge Authorization Logic, DKAL, is constructive logic with a quotation construct said. This logic is known as the logic of infons. The primal fragment of infon logic is amenable to linear time decision algorithms when policies and queries are ground. In the presence of policies with variables and implicit universal quantification, but no functions of positive ...

متن کامل

Transitive Primal Infon Logic

Primal infon logic was introduced in 2009 in connection with access control. In addition to traditional logic constructs, it contains unary connectives p said indispensable in the intended access control applications. Propositional primal infon logic is decidable in linear time, yet suffices for many common access control scenarios. The most obvious limitation on its expressivity is the failure...

متن کامل

Basic primal infon logic

Primal infon logic (PIL) was introduced in 2009 in the framework of policy and trust management. In the meantime, some generalizations appeared, and there have been some changes in the syntax of the basic PIL. This paper is on the basic PIL, and one of our purposes is to “institutionalize” the changes. We prove a small-model theorem for the propositional fragment of basic primal infon logic (PP...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Information and Computation

سال: 2013

ISSN: 0890-5401

DOI: 10.1016/j.ic.2013.08.003